Dimension Reduction and Relaxation of Johnson’s Method for Two Machines Flow Shop Scheduling Problem

Inverse scheduling: two-machine flow-shop problem

We study an inverse counterpart of the two machine flow-shop scheduling problem that arises in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to find job sequence(s) for which the value of the makespan is minimum, in the inverse scheduling the exact values of processing times are unknown and they should be selected with...

Two Stage Flow Shop Scheduling Problem Including Transportation Time and Weightage of Jobs with Branch and Bound Method

Constrained Flow-Shop Scheduling Problem with m Machines

This paper provides a heuristic procedure for solving the constrained flow-shop scheduling problems of n-jobs on m-machines. We obtained a schedule with a set of n-jobs to minimize the mean weighted flow-time. This method is very easy to understand and to apply. It will also help managers in the scheduling related issues by aiding them in the decision making process and providing an optimal or ...

Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...

Parallel Path-Relinking Method for the Flow Shop Scheduling Problem

The matter of using scheduling algorithms in parallel computing environments is discussed in the paper. A parallel path-relinking approach based on scatter search metaheuristics is proposed for the flow shop problem with Cmax and Csum criteria. Obtained results are very promising: the superlinear speedup is observed for some versions of the parallel algorithm.